Interpolation for extended modal languages
نویسنده
چکیده
Several extensions of the basic modal language are characterized in terms of interpolation. Our main results are of the following form: Language L′ is the least expressive extension of L with interpolation. For instance, let M(D) be the extension of the basic modal language with a difference operator [7]. First-order logic is the least expressive extension ofM(D) with interpolation. These characterizations are subsequently used to derive new results about hybrid logic, relation algebra and the guarded fragment. §
منابع مشابه
Hybrid Logics
Hybrid languages are modal languages that have special symbols for naming individual states in models. Their history can be traced back to work of Arthur Prior in the fifties. The subject has recently regained interest, resulting in many new results and techniques. This chapter contains a modern overview of the field. We sketch its history, and survey the basic properties of various hybrid lang...
متن کاملHyLoRes: A Hybrid Logic Prover Based on Direct Resolution
In recent years, an important number of theoretical results concerning axiomatizability, proof systems (tableaux, natural deduction, etc.), interpolation, expressive power, complexity, etc. for hybrid logics has been obtained. The next natural step is to develop provers that can handle these languages. HyLoRes is a direct resolution prover for hybrid logics implementing a sound and complete alg...
متن کاملFusions of Modal Logics Revisited
The fusion Ll Lr of two normal modal logics formulated in languages with disjoint sets of modal operators is the smallest normal modal logic containing Ll [ Lr. This paper proves that decidability, interpolation, uniform interpolation, and Halld encompleteness are preserved under forming fusions of normal polyadic polymodal logics. Those problems remained open in [Fine & Schurz [3]] and [Kracht...
متن کاملNotes on Logics of Metric Spaces
In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expr...
متن کاملInterpolation for First Order S5
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first order S5 interpolation theorem can be proved provided the logic is extended to contain propositional quantifiers. A proper statement of the result involves some subtleties, but this is the essence of it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 70 شماره
صفحات -
تاریخ انتشار 2005